Solution to Travelling Salesman Problem by Nature Inspired Algorithm
نویسندگان
چکیده
منابع مشابه
On the Solutions to the Travelling Salesman Problem using Nature Inspired Computing Techniques
This paper attempts to bring forward various newly emerged natural computing techniques to a common platform. Six such techniques are compared among each other which have been used to solve a w ell known classical problem, the travelling salesman problem. The techniques discussed in this paper are Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Bacterial Foraging Optimization ...
متن کاملA Study of Genetic Algorithm to Solve Travelling Salesman Problem
This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problem...
متن کاملAdapting the Genetic Algorithm to the Travelling Salesman Problem
The combination of local optimisation heuristics and genetic algorithms has been shown to be an effective approach for finding near-optimum solutions to the Travelling Salesman Problem (TSP). In problem domains where the problem can be represented geometrically, such as networks and chemical structures, the combination of local optimisation operators and phenotype genetic operators has also bee...
متن کاملBioinspired Algorithm Applied to Solve the Travelling Salesman Problem
The article is devoted to the study and development of modified bioinspired algorithm and the experimental studies of its characteristics to solve the travelling salesman problem. This algorithm is part of the swarm intelligence method, which is one of bioinspired approaches describing the collective behavior of a decentralized self-organizing system and consists of a multitude of agents (ants)...
متن کاملComparison of Different Heuristic, Metaheuristic, Nature Based Optimization Algorithms for Travelling Salesman Problem Solution
The Traveling Salesman Problem (TSP) is widely studied problems in combinatorial optimization. Many researches were made for that type of problem. This problem is known to be the NPhard problems that cannot be solve by conventional mathematical approach. It is also a sub problem of many areas. Different approaches are performing on it as a general test bench to find solution for NP-had problem....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015905818